Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
نویسندگان
چکیده
منابع مشابه
Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملPreemption in Single Machine Earliness/Tardiness Scheduling
We consider a single machine earliness/tardiness scheduling problem with general weights, ready times and due dates. Using completion time information obtained from the optimal solution to a preemptive relaxation, we generate feasible solutions to the original non-preemptive problem. We report extensive computational results demonstrating the speed and effectiveness of this approach.
متن کاملEarliness-Tardiness Scheduling Around Almost Equal Due Dates
The just-in-time concept in manufacturing has aroused interest in machine scheduling problems with earliness-tardiness penalties. In particular, common due date problems, which are structurally less complicated than problems with general due dates, have emerged as an interesting and proliic eld of research. We prove that so-called almost common due date problems, in which the due date d j and p...
متن کاملMinimizing Total Tardiness in Parallel-Machine Scheduling with Release Dates
The considered problem is the scheduling of a set of N jobs on M identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant ...
متن کاملSingle-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs
This paper deals with a single-machine scheduling problem in which jobs are released in different points in time but delivered to customers in batches. A due window is associated with each job. The objective is to schedule the jobs, to form them into batches and to decide the delivery date of each batch so as to minimize the sum of earliness, tardiness, holding, and delivery costs. A mathematic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics
سال: 1994
ISSN: 0894-069X,1520-6750
DOI: 10.1002/1520-6750(199412)41:7<913::aid-nav3220410705>3.0.co;2-a